PRECONDITIONED PARALLEL BLOCK–JACOBI SVD ALGORITHM
نویسندگان
چکیده
منابع مشابه
Preconditioned Parallel Block-jacobi Svd Algorithm
We show experimentally, that the QR factorization with the complete column pivoting, optionally followed by the LQ factorization of the Rfactor, can lead to a substantial decrease of the number of outer parallel iteration steps in the parallel block-Jacobi SVD algorithm, whereby the details depend on the condition number and on the shape of spectrum, including the multiplicity of singular value...
متن کاملParallel One - Sided Block - Jacobi Svd Algorithm
A new dynamic ordering is presented for the parallel one-sided block Jacobi SVD algorithm. Similarly to the two-sided variant, which has been analyzed and implemented in last 10 years, the dynamic ordering takes into account the actual status of a matrix—this time of its block columns with respect to their mutual orthogonality. Using p processors, in each parallel iteration step the p mostly in...
متن کاملPreconditioning in the Parallel Block - Jacobi Svd Algorithm ∗
One way, how to speed up the computation of the singular value decomposition of a given matrix A ∈ Cm×n, m ≥ n, by the parallel two-sided block-Jacobi method, consists of applying some pre-processing steps that would concentrate the Frobenius norm near the diagonal. Such a concentration should hopefully lead to fewer outer parallel iteration steps needed for the convergence of the entire algori...
متن کاملParallel One-Sided Block Jacobi SVD Algorithm: II. Implementation
This technical report is devoted to the description of implementation details of the accelerated parallel one-sided block Jacobi SVD algorithm, whose analysis and design was described in [21]. We provide discuss a suitable data layout for a parallel implementation of the algorithm on a parallel computer with distributed memory. This discussion is complicated by the fact that different computati...
متن کاملA Parallel Implementation of Lanczos Algorithm in SVD Computation
This work presents a parallel implementation of Lanczos algorithm for SVD Computation using MPI. We investigate execution time as a function of matrix sparsity, matrix size, and the number of processes. We observe speedup and slowdown for parallelized Lanczos algorithm. Reasons for the speedups and the slowdowns are discussed in the report.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Parallel Processing Letters
سال: 2006
ISSN: 0129-6264,1793-642X
DOI: 10.1142/s0129626406002708